Inferring design patterns using the ReP graph.
نویسندگان
چکیده
منابع مشابه
Inferring design patterns using the ReP graph
Periodic refactoring of a large source code often becomes a necessity especially for long-lived projects. In order to increase maintainability and extensibility of such projects, design pattern based refactoring can be seen as an emerging alternative. Manual inspection of source code to find candidate spots where patterns can be introduced is time consuming. Therefore automated tools can help i...
متن کاملInferring Chemical Reaction Patterns Using Rule Composition in Graph Grammars
Modeling molecules as undirected graphs and chemical reactions as graph rewriting operations is a natural and convenient approach to modeling chemistry. Graph grammar rules are most naturally employed to model elementary reactions like merging, splitting, and isomerisation of molecules. It is often convenient, in particular in the analysis of larger systems, to summarize several subsequent reac...
متن کاملStructural Modeling of Design Patterns: REP Diagrams
Software modelling languages should possess a notation, semantics and treatment adapted to design patterns, but its correct specification is a challenge for many investigators. UML treats them as parameterised collaborations, however, this approach is not exempt of problems. The goal of this work is the elaboration of a simple and intuitive model for the structural specification of design patte...
متن کاملInferring human mobility using communication patterns
Understanding the patterns of mobility of individuals is crucial for a number of reasons, from city planning to disaster management. There are two common ways of quantifying the amount of travel between locations: by direct observations that often involve privacy issues, e.g., tracking mobile phone locations, or by estimations from models. Typically, such models build on accurate knowledge of t...
متن کاملDesign Patterns for the Implementation of Graph Algorithms
While the theoretical aspects of many graph algorithms are well understood, the practical application of these algorithms imposes some problems: Typically, the implementation is bound to a specific data structure, the results and their representation are predefined etc. On the other hand, since many graph algorithms use other algorithms to solve subproblems, it is necessary to be able to freely...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Object Technology
سال: 2010
ISSN: 1660-1769
DOI: 10.5381/jot.2010.9.5.a5